The Results of Falcon-AO in the OAEI 2006 Campaign

In this paper, we briefly introduce the architecture of Falcon-AO (version 0.6) and highlight two major improvements in the current version. FalconAO successfully completes all the five alignment tasks in the OAEI 2006 campaign: benchmark, anatomy, directory, food, and conference, and some preliminary results are also reported in this paper. In the end, we present some comments about our results and lessons learnt from the campaign towards building a comprehensive ontology alignment system. 1 Presentation of the System As an infrastructure for the Semantic Web applications, Falcon is a vision of our research group. It desires for providing fantastic technologies for finding, aligning and learning ontologies, and ultimately for capturing knowledge by an ontology-driven approach. It is still under development in our group. As a prominent component of Falcon, Falcon-AO is an automatic tool for aligning ontologies, which is dedicated to aligning the Web ontologies expressed in OWL Lite/DL. To date, Falcon-AO is continually being improved and elaborated, and currently the latest version is 0.6. 1.1 State, Purpose, General Statement Falcon-AO is an automatic ontology alignment tool. There are three elementary matchers implemented in the current version: V-Doc [4], I-Sub [5], and GMO [1]. In addition, an ontology partitioner, PBM [2], is integrated into Falcon-AO to cope with large-scale ontologies. In order to coordinate all the elementary matchers with high quality, we devise a novel central controller, which is based on the observation of the linguistic comparability as well as the structural comparability. The architecture of Falcon-AO (version 0.6) is illustrated in Fig. 1. Compared with our previous prototype (version 0.3) [3], Falcon-AO (version 0.6) is extended mainly in two aspects. One is the integration of PBM. The other is the design of the central controller. The details about the two improvements are presented in the next subsection. Besides, it is worthy of noting that we also refine the implementation of the elementary matchers to save the runtime of matching process.